- convex ordering
- выпуклое упорядочение
The English-Russian dictionary on reliability and quality control. 2015.
convex ordering
Смотреть что такое "convex ordering" в других словарях:
Convex preferences — In economics, convex preferences refer to a property of an individual s ordering of various outcomes which roughly corresponds to the idea that averages are better than the extremes . The concept roughly corresponds to the law of diminishing… … Wikipedia
Convex polytope — A 3 dimensional convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n dimensional space Rn.[1] Some authors use the terms convex polytope and convex… … Wikipedia
Convex conjugate — In mathematics, convex conjugation is a generalization of the Legendre transformation. It is also known as Legendre–Fenchel transformation or Fenchel transformation (after Adrien Marie Legendre and Werner Fenchel). Contents 1 Definition 2… … Wikipedia
Convex cone — In linear algebra, a convex cone is a subset of a vector space over an ordered field that is closed under linear combinations with positive coefficients. A convex cone (light blue). Inside of it, the light red convex cone consists of all points… … Wikipedia
Convex uniform honeycomb — The alternated cubic honeycomb is one of 28 space filling uniform tessellations in Euclidean 3 space, composed of alternating yellow tetrahedra and red octahedra. In geometry, a convex uniform honeycomb is a uniform tessellation which fills three … Wikipedia
Convex bipartite graph — In the mathematical field of graph theory, a convex bipartite graph is a bipartite graph with specific properties. A bipartite graph, (U ∪ V, E), is said to be convex over the vertex set U if U can be enumerated such that for all… … Wikipedia
Stochastic ordering — In statistics, a stochastic order quantifies the concept of one random variable being bigger than another. These are usually partial orders, so that one random variable A may be neither stochastically greater than, less than nor equal to another… … Wikipedia
Antimatroid — In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in which an element, once available for inclusion, remains available until it is included. Antimatroids … Wikipedia
Local consistency — In constraint satisfaction, local consistency conditions are properties of constraint satisfaction problems related to the consistency of subsets of variables or constraints. Several such conditions exist, the most known being node consistency,… … Wikipedia
Cooperative game — This article is about a part of game theory. For video gaming, see Cooperative gameplay. For the similar feature in some board games, see cooperative board game In game theory, a cooperative game is a game where groups of players ( coalitions )… … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
